#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],op[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n,m;cin>>n>>m;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL mx=1;
    vector<LL>v;
    for(LL i=1;i<=m;i++){
        cin>>op[i];
        if(op[i]>=mx){
            v.push_back(op[i]);
            mx=op[i];
        }
    }
    LL k=v.size();
    for(LL i=1;i<=n;i++){
        LL p=-1;
        while(1){
            p=lower_bound(v.begin()+p+1,v.end(),a[i])-v.begin();
            if(p>=k) break;
            a[i]+=v[p];
        }
    }
    for(LL i=1;i<=n;i++){
        cout<<a[i]<<" ";
    }cout<<"\n";
    return 0;
}
